Orthogonal Matching Pursuit with Dictionary Refinement for Multitone Signal Recovery

نویسنده

  • MICHAEL G. MOORE
چکیده

In this paper, we propose a low-cost algorithm for recovering multitone signals from compressive measurements. We introduce a simple and efficient modification to orthogonal matching pursuit. Our approach uses a DFT basis, but refines the frequency estimate obtained at each iteration via a simple gradient descent. We find that by adapting the dictionary in this manner we can realize the benefits of an overcomplete DFT frame without incurring the increased computation. Numerical simulations show that this approach not only outperforms traditional OMP, it even outperforms `1-minimization unless we incur the computational cost of using a highly overcomplete DFT frame.

منابع مشابه

Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing

In compressive sensing, the fundamental problem is to reconstruct sparse signal from its nonadaptive insufficient linear measurement. Besides sparse signal reconstruction algorithms, measurement matrix or measurement dictionary plays an important part in sparse signal recovery. Orthogonal Matching Pursuit (OMP) algorithm, which is widely used in compressive sensing, is especially affected by me...

متن کامل

Signal Recovery in Uncorrelated and Correlated Dictionaries Using Orthogonal Least Squares

Abstract—Though the method of least squares has been used for a long time in solving signal processing problems, in the recent field of sparse recovery from compressed measurements, this method has not been given much attention. In this paper we show that a method in the least squares family, known in the literature as Orthogonal Least Squares (OLS), adapted for compressed recovery problems, ha...

متن کامل

INTERDISCIPLINARY MATHEMATICS INSTITUTE 2010 : 01 Orthogonal super greedy algorithm and application in compressed sensing IMI

The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used for our advantage. In this paper we discuss incoherent dictionaries. We build a new greedy algorithm which is called the Orthogonal Super Greedy Algorithm (OSGA). OSGA is more efficient than a standard Orthogonal Greedy Algorithm (OGA). We show that the rates ...

متن کامل

Complex Orthogonal Matching Pursuit and Its Exact Recovery Conditions

In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex additive white Gaussian noise (CAWGN)). A sufficient condition that OMP can recover the optimal representation of an exactly sparse signal in the complex cases i...

متن کامل

Fast Reconstruction from Random Incoherent Projections

The Compressed Sensing paradigm consists of recovering signals that can be sparsely represented in a given basis from a small set of projections into random vectors; the problem is typically solved using an adapted Basis Pursuit algorithm. We show that the recovery of the signal is equivalent to determining the sparsest representation of the measurement vector using the dictionary obtained by a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013